Efficient Algorithm for Mining Temporal Association Rule
نویسندگان
چکیده
It presents an SPFA(Standing for Segmented Progressive Filter Algorithm).The basic idea behind SPFA is to first segment the database into sub-databases in such a way that item in each sub-database will have either the common starting time or the common ending time. Then, for each sub-databse, SPFA progressively filters candidate 2-itemsets with cumulative filtering thresholds either forward or backward in time. This feature allows SPFA of adopting the scan reduction technique by generating all candidate k-itemsets from candidate 2-itemsets directly. The experimental results show that SPFA significantly outperforms other schemes which are extended from prior methods in terms of the execution time and scalability. The advantage of SPFA becomes even more prominent as the size of the database increases.
منابع مشابه
A new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملNumeric Multi-Objective Rule Mining Using Simulated Annealing Algorithm
Abstract as a single objective one. Measures like support, confidence and other interestingness criteria which are used for evaluating a rule, can be thought of as different objectives of association rule mining problem. Support count is the number of records, which satisfies all the conditions that exist in the rule. This objective represents the accuracy of the rules extracted from the da...
متن کاملData sanitization in association rule mining based on impact factor
Data sanitization is a process that is used to promote the sharing of transactional databases among organizations and businesses, it alleviates concerns for individuals and organizations regarding the disclosure of sensitive patterns. It transforms the source database into a released database so that counterparts cannot discover the sensitive patterns and so data confidentiality is preserved ag...
متن کاملA Novel Method for Mining Video Association Rules Using Weighted Temporal Tree
With the ever-growing digital libraries and video databases, it is increasingly important to understand and mine the knowledge from video database automatically. Video association mining is a relatively new and emerging research trend used to discover and describe interesting patterns in video. The traditional classical association rule mining algorithms can not apply directly to the video. It ...
متن کاملAssociation Rule Mining Considering Local Frequent Patterns with Temporal Intervals
In traditional association rule mining algorithms, if the minimum support is set too high, many valuable rules will be lost. However, if the value is set too low, then numerous trivial rules will be generated. To overcome the difficulty of setting minimum support values, global and local patterns are mined herein. Owing to the temporal factor in association rule mining, an itemset may not occur...
متن کاملAn Efficient Technique for Indexing Temporal Databases
Temporal databases added a new dimension to traditional transaction databases. This dimension is the life time of each item, i.e. exhibition period, starting from the partition when this item appears in the transaction database to the partition when this item no longer exists. Mining temporal association rules became very interesting topic in many applications nowadays. In this paper, an effici...
متن کامل